Displacement structure of weighted pseudoinverses

نویسندگان

  • Jianfeng Cai
  • Yimin Wei
چکیده

Estimates for the rank of AMNV − UA † MN and more general displacement of A † MN are presented,where AMN is the weighted pseudoinverse of a matrix A.The results are applied to the close-to-Toeplitz,close-to-Vandermonde and close-to-Cauchy matrices.We extend the results due to G. Heinig and F. Hellinger in 1994.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equivalent formulae for the supremum and stability of weighted pseudoinverses

During recent decades, there have been a great number of research articles studying interior-point methods for solving problems in mathematical programming and constrained optimization. Stewart and O’Leary obtained an upper bound for scaled pseudoinverses sup W∈P ‖(W 12X)+W 2 ‖2 of a matrix X where P is a set of diagonal positive definite matrices. We improved their results to obtain the suprem...

متن کامل

The Supremum and Stability of Weighted Pseudoinverses

During recent decades, there have been a great number of research articles studying interior-point methods for solving problems in mathematical programming and constrained optimization. Stewart and O'Leary obtained an upper bound for scaled pseudoinverses sup W2P k(W 1 2 X) + W 1 2 k 2 of a matrix X where P is a set of diagonal positive deenite matrices. We improved their results to obtain the ...

متن کامل

Recurrent Neural Networks for Computing Pseudoinverses of Rank-Deficient Matrices

Three recurrent neural networks are presented for computing the pseudoinverses of rank-deficient matrices. The first recurrent neural network has the dynamical equation similar to the one proposed earlier for matrix inversion and is capable of Moore–Penrose inversion under the condition of zero initial states. The second recurrent neural network consists of an array of neurons corresponding to ...

متن کامل

Hyperbolic pseudoinverses for kinematics in the Euclidean group

The kinematics of a robot manipulator are described in terms of the mapping connecting its joint space and the 6-dimensional Euclidean group of motions SE(3). The associated Jacobian matrices map into its Lie algebra se(3), the space of twists describing infinitesimal motion of a rigid body. Control methods generally require knowledge of an inverse for the Jacobian. However for an arm with fewe...

متن کامل

Regularized Computation of Approximate Pseudoinverse of Large Matrices Using Low-Rank Tensor Train Decompositions

We propose a new method for low-rank approximation of Moore-Penrose pseudoinverses (MPPs) of large-scale matrices using tensor networks. The computed pseudoinverses can be useful for solving or preconditioning large-scale overdetermined or underdetermined systems of linear equations. The computation is performed efficiently and stably based on the modified alternating least squares (MALS) schem...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Applied Mathematics and Computation

دوره 153  شماره 

صفحات  -

تاریخ انتشار 2004